Bipartite graphs with small third Laplacian eigenvalue
نویسنده
چکیده
In this paper, all connected bipartite graphs are characterized whose third largest Laplacian eigenvalue is less than three. Moreover, the result is used to characterize all connected bipartite graphs with exactly two Laplacian eigenvalues not less than three, and all connected line graphs of bipartite graphs with the third eigenvalue of their adjacency matrices less than one. c © 2003 Elsevier B.V. All rights reserved. MSC: 05C50; 05C75; 15A18
منابع مشابه
Bipartite Subgraphs and the Signless Laplacian Matrix
For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalised Laplacian eigenvalue. We investigate how vectors yielding small values of the Rayleigh quotient for the signless Laplacian matrix can be used to identify bipartite subgraphs. Our results are applied to some graphs with degree sequences approximately following a pow...
متن کاملThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Let U(n, k) be the set of non-bipartite unicyclic graphs with n vertices and k pendant vertices, where n ≥ 4. In this paper, the unique graph with the minimal least eigenvalue of the signless Laplacian among all graphs in U(n, k) is determined. Furthermore, it is proved that the minimal least eigenvalue of the signless Laplacian is an increasing function in k. Let Un denote the set of non-bipar...
متن کاملEla the Least Eigenvalue of the Signless Laplacian of Non-bipartite Unicyclic Graphs with K Pendant Vertices
Let U(n, k) be the set of non-bipartite unicyclic graphs with n vertices and k pendant vertices, where n ≥ 4. In this paper, the unique graph with the minimal least eigenvalue of the signless Laplacian among all graphs in U(n, k) is determined. Furthermore, it is proved that the minimal least eigenvalue of the signless Laplacian is an increasing function in k. Let Un denote the set of non-bipar...
متن کاملGraphs with four distinct Laplacian eigenvalues
In this paper, we investigate connected nonregular graphs with four distinct Laplacian eigenvalues. We characterize all such graphs which are bipartite or have exactly one multiple Laplacian eigenvalue. Other examples of interest are also presented.
متن کاملOn the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum degree Δ, respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 278 شماره
صفحات -
تاریخ انتشار 2004